#include <iostream>
#include <fstream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <deque>
#include <ctime>
#include <cstdlib>

using namespace std;

#define sz(x) ((int)((x).size()))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const double EPS = 1e-9;
const double PI = acos(-1.0);

const int MOD = (int)(1e9);

void add(int &x, int y) {
	x += y;
	if (x >= MOD)
		x -= MOD;
}

int n;
char str[350];
int dp[350][350][2];

int go(int lf, int rg, int f) {
	if (lf > rg)
		return 0;
	if (dp[lf][rg][f] != -1)
		return dp[lf][rg][f];
	if (str[lf] != str[rg])
		return (dp[lf][rg][f] = 0);
	int &res = dp[lf][rg][f];
	res = go(lf + 1, rg - 1, true);
	if (!f)
		return res;
	for (int i = lf + 1; i < rg; i++) {
		if (str[i] == str[lf]) {
			add(res, go(lf, i, 1) * 1LL * go(i, rg, 0) % MOD);
		}
	}
	return res;
}

int main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	scanf("%s", str);
	n = strlen(str);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dp[i][j][0] = dp[i][j][1] = -1;
		}
		dp[i][i][0] = 0;
		dp[i][i][1] = 1;
	}
	printf("%d\n", go(0, n - 1, true));

	return 0;
}
